Trees with unique minimum total dominating sets
نویسندگان
چکیده
A set S of vertices of a graph G is a total dominating set if every vertex of V (G) is adjacent to some vertex in S. We provide three equivalent conditions for a tree to have a unique minimum total dominating set and give a constructive characterization of such trees.
منابع مشابه
Trees with unique minimum p - dominating sets ∗
Let p be a positive integer and G = (V,E) a simple graph. A p-dominating set of G is a subset S of V such that every vertex not in S is dominated by at least p vertices in S. The p-domination number γp(G) is the minimum cardinality among the p-dominating sets of G. In this paper, for p ≥ 2, we give three equivalent conditions for trees with unique minimum p-dominating sets and also give a const...
متن کاملLocating and total dominating sets in trees
Locating and Total Dominating Sets in Trees by Jamie Marie Howard A set S of vertices in a graph G = (V,E) is a total dominating set of G if every vertex of V is adjacent to some vertex in S. In this thesis, we consider total dominating sets of minimum cardinality which have the additional property that distinct vertices of V are totally dominated by distinct subsets of the total dominating set.
متن کاملOn graphs with equal total domination and connected domination numbers
A subset S of V is called a total dominating set if every vertex in V is adjacent to some vertex in S. The total domination number γt (G) of G is the minimum cardinality taken over all total dominating sets of G. A dominating set is called a connected dominating set if the induced subgraph 〈S〉 is connected. The connected domination number γc(G) of G is the minimum cardinality taken over all min...
متن کاملA characterisation of cycle-disjoint graphs with unique minimum weakly connected dominating set
Let G be a connected graph with vertex set V (G). A set S of vertices in G is called a weakly connected dominating set of G if (i) S is a dominating set of G and (ii) the graph obtained from G by removing all edges joining two vertices in V (G) \ S is connected. A weakly connected dominating set S of G is said to be minimum or a γw-set if |S| is minimum among all weakly connected dominating set...
متن کاملVertices belonging to all or to no minimum double dominating sets in trees
In a graph G = (V, E) , a vertex dominates itself and all its neighbors. A double dominating set of G is a dominating set that dominates every vertex of G at least twice. In this paper, we characterize vertices that are in all or in no minimum double dominating sets in trees.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 22 شماره
صفحات -
تاریخ انتشار 2002